Metaheuristic Search as a Cryptological Tool

نویسنده

  • John Andrew Clark
چکیده

Cryptology is a thriving research area of great practical importance. It is a fundamental building block of communications security. Metaheuristic optimisation techniques such as simulated annealing and genetic algorithms have found successful application in a huge number of fields. However, their application to leading edge industrial-strength cryptology has been slight. The power of metaheuristic search is, however, greatly under-estimated. The research reported here shows how a range of modern-day cryptological problems can be attacked successfully using metaheuristic search. Along the way, the work provides the cryptological researcher with many new approaches to applying metaheuristic search techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Ants to Attack a Classical Cipher

Transposition ciphers are a class of historical encryption algorithms based on rearranging units of plaintext according to some fixed permutation which acts as the secret key. Transpositions form a building block of modern ciphers, and applications of metaheuristic optimisation techniques to classical ciphers have preceded successful results on modern-day cryptological problems. In this paper w...

متن کامل

Metaheuristic Aided Software Features Assembly

One significant task addressed during software development project is to determine which features should be covered by the application that is being developed. This problem is known as the Next Release Problem (NRP) and has been solved using metaheuristic search techniques. We show how to apply these techniques by its embedding into a requirement management tool as an assistant functionality. W...

متن کامل

A GRASP Metaheuristic for the Coverage of Grid Environments with Limited-Footprint Tools

Coverage of known environments is a task involved in several applications of autonomous mobile robots, like patrolling, search and rescue, and cleaning. The (single robot) coverage problem can be formulated as that of finding the optimal tour that, when followed, allows a robot to cover with its tool (e.g., a sensor or a brush) all the points of the free space of a given environment. Most of th...

متن کامل

Optimum Design of Steel Space Frames by Hybrid Teaching-Learning Based Optimization and Harmony Search Algorithms

This study presents a hybrid metaheuristic algorithm to obtain optimum designs for steel space buildings. The optimum design problem of three-dimensional steel frames is mathematically formulated according to provisions of LRFD-AISC (Load and Resistance factor design of American Institute of Steel Construction). Design constraints such as the strength requirements of structural members, the dis...

متن کامل

Weight Optimization in Recurrent Neural Networks with Hybrid Metaheuristic Cuckoo Search Techniques for Data Classification

Recurrent neural network (RNN) has been widely used as a tool in the data classification. This network can be educated with gradient descent back propagation. However, traditional training algorithms have some drawbacks such as slow speed of convergence being not definite to find the global minimum of the error function since gradient descent may get stuck in local minima. As a solution, nature...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002